Use of Measurements for Enforcing the Necessary Conditions of Optimality in the Presence of Constraints and Uncertainty
نویسندگان
چکیده
Process measurements can be used in an optimization framework to compensate the effects of run-time uncertainty. Among the various options for input adaption, a promising approach consists of directly enforcing the Necessary Conditions of Optimality (NCO) that include two parts: the active constraints and the sensitivities. In this paper, the variations of the NCO under parametric uncertainty are studied and used to design appropriate adaptation laws. The inputs are separated into constraint-seeking and sensitivity-seeking directions depending on which part of the NCO they enforce. In addition, the directional influence of uncertainty is used to reduce the number of variables to be adapted. The theoretical concepts are illustrated in simulation on the run-to-run optimization of a batch emulsion polymerization reactor.
منابع مشابه
Regularity Conditions for Non-Differentiable Infinite Programming Problems using Michel-Penot Subdifferential
In this paper we study optimization problems with infinite many inequality constraints on a Banach space where the objective function and the binding constraints are locally Lipschitz. Necessary optimality conditions and regularity conditions are given. Our approach are based on the Michel-Penot subdifferential.
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملMangasarian-Fromovitz and Zangwill Conditions For Non-Smooth Infinite Optimization problems in Banach Spaces
In this paper we study optimization problems with infinite many inequality constraints on a Banach space where the objective function and the binding constraints are Lipschitz near the optimal solution. Necessary optimality conditions and constraint qualifications in terms of Michel-Penot subdifferential are given.
متن کاملTwo-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints
This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints. Firstly, we consider some lower level constraint qualifications (CQs) for this problem. Then, under these CQs, we derive formula for estimating the subdifferential of its valued function. Finally, we present some necessary optimality condit...
متن کاملDuality for vector equilibrium problems with constraints
In the paper, we study duality for vector equilibrium problems using a concept of generalized convexity in dealing with the quasi-relative interior. Then, their applications to optimality conditions for quasi-relative efficient solutions are obtained. Our results are extensions of several existing ones in the literature when the ordering cones in both the objective space and the constr...
متن کامل